Hard Choice

Memory limit: 64 MB

Byteasar has always been experiencing problems with making decisions. Each time he travels through Bytetown and knows that there are at least two totally different possible routes, it takes him ages to decide on a particular one. Byteasar has recently heard about roadworks that are planned in Bytetown. He is maybe the only person in town who is glad to hear this: there is a chance that road closures will ease his pain of making decisions.

In Bytetown there are junctions connected with bidirectional streets. Two routes connecting a given pair of junctions are called totally different if they share no common streets. Such routes may, however, lead through common junctions.

Byteasar is eagerly tracking the road closures. At first he was able to check whether there exist at least two totally different routes connecting given pairs of junctions, but at some point updating such data became hard for him. Could you write a program that will help him with this problem?

Input

The first line of input contains three integers , and (, ) denoting the number of junctions and the number of streets in Bytetown, and the number of events, respectively. The junctions are numbered through .

The following lines contain descriptions of streets, each consisting of two integers , (, ). Such a pair represents a bidirectional street connecting the junctions and . Each pair of junctions is connected with at most one street.

The following lines contain descriptions of events, each description consists of a letter and two integers , (, , ). The events are listed chronologically. An event with denotes a closure of the street connecting junctions and . You can assume that such street exists and that it has never been closed before. Note that the roadworks may be performed in a chaotic manner - in particular, at some point all streets in Bytetown may become closed! On the other hand, an event with denotes that Byteasar would like to travel between junctions and and therefore he would like to know if he can do this in at least two totally different ways (he may use only the streets that have not been closed yet).

Output

Output a single line for each event of type P, in the same order as the events appear in the input. If there are two routes connecting the given pair of junctions leading through disjoint sets of streets, output the word TAK (i.e., yes in Polish). Otherwise, output NIE (no in Polish). You may assume that the output will not be empty.

Example

For the input data:

7 8 7
1 2
1 3
1 4
2 3
3 4
3 7
7 4
5 6
Z 1 4
P 1 3
P 2 4
Z 1 3
P 1 3
Z 6 5
P 5 6

the correct result is:

TAK
TAK
NIE
NIE

Task author: Jakub Lacki.